On the submodularity of multi-depot traveling salesman games
نویسندگان
چکیده
منابع مشابه
On Traveling Salesman Games with Asymmetric Costs
We consider cooperative traveling salesman games with non-negative asymmetric costs satisfying the triangle inequality. We construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem, using the parsimonious property and a previously unknown connection to linear production games. We also show that our techn...
متن کاملTraveling salesman games with the Monge property
Several works have indicated the relationships between polynomially solvable combinatorial optimization problems and the core non-emptiness of cooperative games associated with them, and between intractable combinatorial optimization problems and the hardness of the problem to decide the core non-emptiness of the associated games. In this paper, we study the core of a traveling salesman game, w...
متن کاملMulti-Criteria Traveling Salesman Problems
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملPerformance Evaluation of Ant Colony Systems for the Single-Depot Multiple Traveling Salesman Problem
Derived from the well-known Traveling Salesman problem (TSP), the multiple-Traveling Salesman problem (multiple-TSP) with single depot is a straightforward generalization: several salesmen located in a given city (the depot) need to visit a set of interconnected cities, such that each city is visited exactly once (by a single salesman) while the total cost of their tours is minimized. Designed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.11.029